Source: Engineering Optimization. Unidade: EESC
Subjects: PROGRAMAÇÃO DA PRODUÇÃO, SCHEDULING, ALGORITMOS DE SCHEDULING, ENGENHARIA DE PRODUÇÃO
ABNT
PRATA, Bruno de Athayde e NAGANO, Marcelo Seido. A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness. Engineering Optimization, p. [1-15], 2022Tradução . . Disponível em: https://doi.org/10.1080/0305215X.2022.2144274. Acesso em: 28 abr. 2024.APA
Prata, B. de A., & Nagano, M. S. (2022). A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness. Engineering Optimization, [1-15]. doi:10.1080/0305215X.2022.2144274NLM
Prata B de A, Nagano MS. A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness [Internet]. Engineering Optimization. 2022 ; [1-15].[citado 2024 abr. 28 ] Available from: https://doi.org/10.1080/0305215X.2022.2144274Vancouver
Prata B de A, Nagano MS. A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness [Internet]. Engineering Optimization. 2022 ; [1-15].[citado 2024 abr. 28 ] Available from: https://doi.org/10.1080/0305215X.2022.2144274